The Existence of Double Error-Correcting Perfect Codes in Random Graphs
نویسندگان
چکیده
We determine the limiting distribution for the existence of a 2-errorcorrecting perfect code in the random graph G(n, p). Mathematics Subject Classification: 05C80
منابع مشابه
Perfect One Error Correcting Codes on Iterated Complete Graphs
Given an arbitrary graph, a perfect one error correcting code is a subset of the vertices called codewords such that no two codewords are adjacent and every non-codeword is adjacent to exactly one codeword. Determining if there is a perfect one error correcting code on an arbitrary graph seems di cult; in fact, it is NP-Complete. We present a biin nite family of graphs based on the complete gra...
متن کاملPerfect Codes in Cartesian Products of 2-Paths and Infinite Paths
We introduce and study a common generalization of 1-error binary perfect codes and perfect single error correcting codes in Lee metric, namely perfect codes on products of paths of length 2 and of infinite length. Both existence and nonexistence results are given.
متن کاملOptimal Cycle Codes Constructed From Ramanujan Graphs
We aim here at showing how some known Ramanujan Cayley graphs yield error-correcting codes that are asymptotically optimal in the class of cycle codes of graphs. The main reason why known constructions of Ramanujan graphs yield good cycle codes is that the number of their cycles of a given length behaves essentially like that of random regular graphs. More precisely we show that for actual cons...
متن کاملPerfect Mannheim, Lipschitz and Hurwitz weight codes
The set of residue classes modulo an element π in the rings of Gaussian integers, Lipschitz integers and Hurwitz integers, respectively, is used as alphabets to form the words of error correcting codes. An error occurs as the addition of an element in a set E to the letter in one of the positions of a word. If E is a group of units in the original rings, then we obtain the Mannheim, Lipschitz a...
متن کاملA new approach towards the Golomb-Welch conjecture
The Golomb-Welch conjecture deals with the existence of perfect eerror correcting Lee codes of word length n, PL(n, e) codes. Although there are many papers on the topic, the conjecture is still far from being solved. In this paper we initiate the study of an invariant connected to abelian groups that enables us to reformulate the conjecture, and then to prove the non-existence of linear PL(n, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008